151 research outputs found
New results on word-representable graphs
A graph is word-representable if there exists a word over the
alphabet such that letters and alternate in if and only if
for each . The set of word-representable graphs
generalizes several important and well-studied graph families, such as circle
graphs, comparability graphs, 3-colorable graphs, graphs of vertex degree at
most 3, etc. By answering an open question from [M. Halldorsson, S. Kitaev and
A. Pyatkin, Alternation graphs, Lect. Notes Comput. Sci. 6986 (2011) 191--202.
Proceedings of the 37th International Workshop on Graph-Theoretic Concepts in
Computer Science, WG 2011, Tepla Monastery, Czech Republic, June 21-24, 2011.],
in the present paper we show that not all graphs of vertex degree at most 4 are
word-representable. Combining this result with some previously known facts, we
derive that the number of -vertex word-representable graphs is
From matchings to independent sets
In 1965, Jack Edmonds proposed his celebrated polynomial-time algorithm to find a maximum matching in a graph. It is well-known that finding a maximum matching in G is equivalent to finding a maximum independent set in the line graph of G. For general graphs, the maximum independent set problem is NP-hard. What makes this problem easy in the class of line graphs and what other restrictions can lead to an efficient solution of the problem? In the present paper, we analyze these and related questions. We also review various techniques that may lead to efficient algorithms for the maximum independent set problem in restricted graph families, with a focus given to augmenting graphs and graph transformations. Both techniques have been used in the solution of Edmonds to the maximum matching problem, i.e. in the solution to the maximum independent set problem in the class of line graphs. We survey various results that exploit these techniques beyond the line graphs
Independent sets of maximum weight in apple-free graphs
We present the first polynomial-time algorithm to solve the maximum weight independent set problem for apple-free graphs, which is a common generalization of several important classes where the problem can be solved efficiently, such as claw-free graphs, chordal graphs, and cographs. Our solution is based on a combination of two algorithmic techniques (modular decomposition and decomposition by clique separators) and a deep combinatorial analysis of the structure of apple-free graphs. Our algorithm is robust in the sense that it does not require the input graph G to be apple-free; the algorithm either finds an independent set of maximum weight in G or reports that G is not apple-free
Universal graphs and universal permutations
Let be a family of graphs and the set of -vertex graphs in .
A graph containing all graphs from as induced subgraphs is
called -universal for . Moreover, we say that is a proper
-universal graph for if it belongs to . In the present paper, we
construct a proper -universal graph for the class of split permutation
graphs. Our solution includes two ingredients: a proper universal 321-avoiding
permutation and a bijection between 321-avoiding permutations and symmetric
split permutation graphs. The -universal split permutation graph constructed
in this paper has vertices, which means that this construction is
order-optimal.Comment: To appear in Discrete Mathematics, Algorithms and Application
Hereditary classes of graphs : a parametric approach
The world of hereditary classes is rich and diverse and it contains a variety of classes of theoretical and practical importance. Thousands of results in the literature are devoted to individual classes and only a few of them analyse the universe of hereditary classes as a whole. To shift the analysis into a new level, in the present paper we exploit an approach, where we operate by infinite families of classes, rather than individual classes. Each family is associated with a graph parameter and is characterized by classes that are critical with respect to the parameter. In particular, we obtain a complete parametric description of the bottom of the lattice of hereditary classes and discuss a number of open questions related to this approach
- …